Indecomposable Skolem and Rosa sequences
نویسندگان
چکیده
We introduce indecomposable (hooked) Skolem sequences and we show their existence for all admissible orders. We then introduce a new construction for two-fold triple systems from two-fold Skolem sequences, and use this to motivate the concept of a two-fold Rosa sequence, whose existence we show for all admissible orders.
منابع مشابه
Cyclically Indecomposable Triple Systems that are Decomposable
Cyclically Indecomposable Triple Systems that are Decomposable Martin Grüttmüller Institut für Mathematik, Universität Rostock In this talk, we construct, by using Skolem-type and Rosa-type sequences, cyclically indecomposable two-fold triple systems TS2(v) for all admissible orders. We also investigate exhaustively the cyclically indecomposable triple systems TSλ(v) for λ = 2, v ≤ 33 and λ = 3...
متن کاملCyclic, Simple and Indecomposable Three-Fold Triple Systems
In 2000, Rees and Shalaby constructed simple indecomposable two-fold cyclic triplesystems for all v ≡ 0, 1, 3, 4, 7, and 9 (mod 12) where v = 4 or v ≥ 12, using Skolem-type sequences.We construct, using Skolem-type sequences, three-fold triple systems having theproperties of being cyclic, simple, and indecomposable for all admissible orders v, withsome possible exception...
متن کاملOn the graceful labelling of triangular cacti conjecture
A graceful labelling of a graph with n edges is a vertex labelling where the induced set of edge weights is {1, . . . , n}. A near graceful labelling is almost the same, the difference being that the edge weights are {1, 2, . . . , n − 1, n + 1}. In both cases, the weight of an edge is the absolute difference between its two vertex labels. Rosa [8] in 1988 conjectured that all triangular cacti ...
متن کاملExponential lower bounds for the numbers of Skolem-type sequences
It was shown by Abrham that the number of pure Skolem sequences of order n, n ≡ 0 or 1 (mod 4), and the number of extended Skolem sequences of order n, are both bounded below by 2bn/3c. These results are extended to give similar lower bounds for the numbers of hooked Skolem sequences, split Skolem sequences and split-hooked Skolem sequences.
متن کاملNP-completeness of generalized multi-Skolem sequences
A Skolem sequence is a sequence a1, a2, . . . , a2n (where ai ∈ A = {1, . . . , n}), each ai occurs exactly twice in the sequence and the two occurrences are exactly ai positions apart. A set A that can be used to construct Skolem sequences is called a Skolem set. The existence question of deciding which sets of the form A = {1, . . . , n} are Skolem sets was solved by Thoralf Skolem [6] in 195...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 21 شماره
صفحات -
تاریخ انتشار 2000